Generating Maze-Like Images by Connecting Voronoi Regions Using Minimum Spanning Trees

Generating Random Spanning Trees

This paper describes a probabilistic algorithm that, given a connected, undirected graph G with n vertices, produces a spanning tree of G chosen uniformly at random among the spanning trees of G. The expected running time is O(n logn) per generated tree for almost all graphs, and O(n3) for the worst graphs. Previously known deterministic algorithms and much more complicated and require O(n3) ti...

Information Theoretic Clustering Using Minimum Spanning Trees

In this work we propose a new information-theoretic clustering algorithm that infers cluster memberships by direct optimization of a non-parametric mutual information estimate between data distribution and cluster assignment. Although the optimization objective has a solid theoretical foundation it is hard to optimize. We propose an approximate optimization formulation that leads to an efficien...

Geometric Minimum Spanning Trees

Let S be a set of n points in < d. We present an algorithm that uses the well-separated pair decomposition and computes the minimum spanning tree of S under any Lp or polyhedral metric. It has an expected running time of O(n logn) for uniform distributions. Experimentalresults show that this approachis practical. Under a variety of input distributions, the resultingimplementation is robust and ...

Minimum Spanning Trees∗

1 Background Members of some secret party want to shutdown some high risk communication channals, while preserving low risk channals to ensure that members are still connected in the secret network.

2D image segmentation using minimum spanning trees